Scheduling multiprocessor tasks with genetic algorithms
نویسندگان
چکیده
منابع مشابه
Scheduling Multiprocessor Tasks with Genetic Algorithms
In this paper, an efficient method based on genetic algorithms is developed to solve the multiprocessor scheduling problem. To efficiently execute programs in parallel on multiprocessor scheduling problem must be solved to determine the assignment of tasks to the processors and the execution order of the tasks so that the execution time is minimized. Even when the target processors is fully con...
متن کاملLayer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints
c © 2007 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملImproved Multiprocessor Task Scheduling Using Genetic Algorithms
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to be a topic of considerable research. Approximate solutions to this NPcomplete problem typically combine search techniques and heuristics. Traditional solutions require a deterministic search of the solution space, which is computationally and temporally exhaustive. Genetic algorithms are known to ...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملOn-line Multiprocessor Tasks Scheduling with Rejection
This paper deals with multiprocessor task scheduling with ready times, due dates and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by given ready times, respecting their due dates. Moreover, a task can be examined in order to be processed only when it enters the scheduler. The concept of rejection is int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1999
ISSN: 1045-9219
DOI: 10.1109/71.790600